Hyper hamiltonian laceability on edge fault star graph
نویسندگان
چکیده
The star graph possess many nice topological properties. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. In this paper, we show that the n-dimensional star graph is (n 3)-edge fault tolerant hamiltonian laceable, (n 3)-edge fault tolerant strongly hamiltonian laceable, and (n 4)edge fault tolerant hyper hamiltonian laceable. All these results are optimal in a sense described in this paper. 2003 Elsevier Inc. All rights reserved.
منابع مشابه
Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs
Let Sn be an n-dimensional Star graph. In this paper, we show that Sn − F is Hamiltonian laceable where F is the set of f ≤ (n − 4) pairs of adjacent faulty vertices, Sn − F is Hamiltonian where F is the set of f ≤ (n − 3) pairs of adjacent faulty vertices. We also show that Sn − F is hyper-Hamiltonian laceable where F is the set of f ≤ (n − 4) pairs of adjacent faulty vertices. Applying these ...
متن کاملOn the Enhanced Hyper-hamiltonian Laceability of Hypercubes
A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any two vertices that are in different partite sets. A hamiltonian laceable graph G is said to be hyperhamiltonian laceable if, for any vertex v of G, there exists a hamiltonian path of G−{v} joining any two vertices that are located in the same partite set different from that of v. In this paper, we further im...
متن کاملlgorithms of the Hyper - Star Graph and its Related Graphs
The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also bee...
متن کاملOn the Hamiltonian Laceability of Honeycomb Toroidal Graphs
The Honeycomb toroidal graph is a highly symmetric, vertex-transitive, bipartite graph which has been investigated for certain properties including pan-cyclicity and Hamilton laceability. The main focus of this project was to construct generalised methods for finding Hamilton paths and thus provide a proof of Hamilton laceability for this graph. The resulting proof was successful for a subset o...
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 165 شماره
صفحات -
تاریخ انتشار 2004